Видео с ютуба Automata Course

1. Introduction, Finite Automata, Regular Expressions

Why study theory of computation?

Regular Languages: Deterministic Finite Automaton (DFA)